Psychological Validity of Schematic Proofs
نویسندگان
چکیده
Schematic proofs are functions which can produce a proof of a proposition for each value of their parameters. A schematic proof can be constructed by abstracting a general pattern of proof from several examples of a family of proofs. In this paper we examine several interesting aspects of the use of schematic proofs in mathematics. Furthermore, we pose several conjectures about the psychological validity of the use of schematic proofs in mathematics. These conjectures need testing, hence we propose an empirical study which would either support or refute our conjectures. Ultimately, we suggest that schematic proofs are worthy of a closer and more detailed study and investigation.
منابع مشابه
Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF
Software that can produce independently checkable evidence for the correctness of its output has received recent attention for use in certifying compilers and proofcarrying code. CVC (“a Cooperating Validity Checker) is a proof-producing validity checker for a decidable fragment of first-order logic enriched with background theories. This paper describes how proofs of valid formulas are produce...
متن کاملThe Role of Schematic Mentalities in Predicting the Nurses’ Quality of Professional Life Considering the Mediating Role of Psychological Well-Being
Introduction: Nurses’ frequent confrontation with critical and painful conditions of patients in different wards can decrease the quality of professional life that can lead to psychological damages such as decline in quality of care-taking and outcomes of care-taking programs. In this regard, the present study aimed to investigate the role of schematic mentalities in predicting the nurses’ qual...
متن کاملSystem Description: GAPT for schematic proofs
In contrast to automated and interactive theorem provers, which focus on the construction of proofs, GAPT (General Architecture for Proof Theory) is a proof theory framework concentrating on the transformation and further processing of proofs. In this paper, we describe an extension of GAPT for handling schematic proofs, that is recursively defined LK-proofs.
متن کاملMany-Sorted Logic in a Learning Theorem Prover
In a learning theorem prover, formulas can be veriied by reusing proofs of previously veriied conjectures. Reuse proceeds by transforming a successful proof into a valid schematic formula which can be instantiated subsequently. In this paper, we show how this reuse approach is extended to many-sorted logic: We rst present the logical foundations for reasoning w.r.t. diierent sortings. Then thei...
متن کاملOn Automating Diagrammatic Proofs of Arithmetic Arguments
Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which humans can prove by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is often more clearly perceived in these proofs than in the corresponding algebraic proofs; they capture an intuitive notion of truthfulness that humans find easy to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005